/*
 * Copyright (c) 2013, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */

package demo.parallelcore;

/**
 * <p>
 * A tuple of two elements.
 * </p> 
 */
public class Pair<A,B>{
    private final A val0;
    private final B val1;

    
    public static <A,B> Pair<A,B> with(final A value0, final B value1) {
        return new Pair<>(value0,value1);
    }

    public Pair(final A value0, final B value1) {
        this.val0 = value0;
        this.val1 = value1;
    }
    
    public A getValue0() {
        return this.val0;
    }

    public B getValue1() {
        return this.val1;
    }
    
    @Override
    public boolean equals(Object o){
        if(o == this) return true;
        if(!(o instanceof Pair))
            return false;
        @SuppressWarnings("unchecked")
        Pair<A,B> compared = (Pair<A,B>)o;
        return val0.equals(compared.getValue0()) 
                && val1.equals(compared.getValue1());
    }

    @Override
    public int hashCode() { 
      return(val0.hashCode() + (31 * val1.hashCode()));
    }
}
